Realizing Changes of Operational Modes with a Pre Run - Time Scheduled Hard Real - Time System GERHARD
نویسندگان
چکیده
Most hard real-time computer systems control processes that undergo several, mutually exclusive modes of operation. This paper discusses issues of handling mode changes and requirements for their application. Speci cation of mode changes, construction of static schedules for modes and transitions, and run-time execution of mode changes are presented. We propose concepts for mode changes in the context of MARS, a pre run-time scheduled hard realtime system. Our methods adhere closely to the ones established for single modes. By decomposing the system into a set of disjoint modes, the design process and its comprehension are facilitated, testing e orts are reduced signi cantly, and solutions are enabled which do not exist if all system activities of all modes are combined into a single schedule.
منابع مشابه
Realizing Changes of Operational Modes with a Pre Run-Time Scheduled Hard Real-Time System
Most hard real-time computer systems control processes that undergo several, mutually exclusive modes of operation. This paper discusses issues of handling mode changes and requirements for their application. Speci cation of mode changes, construction of static schedules for modes and transitions, and run-time execution of mode changes are presented. We propose concepts for mode changes in the ...
متن کاملChanging Operational Modes in the Context of PreRun - Time
Typical processes controlled by hard real-time computer systems undergo several, mutually exclusive modes of operation. By deterministically switching among a number of static schedules, a pre run-time scheduled system is able to adapt to changing environmental situations. This paper presents concepts for speci cation of mode changes, construction of static schedules for modes and transitions, ...
متن کاملReal-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm
The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...
متن کاملExecution times∗and execution jitter analysis of real-time tasks under fixed-priority pre-emptive scheduling
In this paper, we present worst-case and best-case execution times and (absolute) execution jitter analysis of independent, periodically activated, hard real-time tasks that are executed on a single processor under fixed-priority pre-emptive scheduling (FPPS), arbitrary phasing, (absolute) activation jitter, and deadlines at most equal to (worst-case) periods minus activation jitter. We prove t...
متن کاملJoint Scheduling of Distributed Complex Periodic and Hard Aperiodic Tasks in Statically Scheduled Systems
In this paper we present algorithms for the joint scheduling of periodic and aperiodic tasks in statically scheduled distributed real-time systems. Periodic tasks are precedence constrained, distributed, and communicating over the nodes of the systems. Both soft and hard aperiodic tasks are handled. After a static schedule has been created in a rst step, the algorithms determine the amount and ...
متن کامل